Local obstacle avoidance walking method of self-moving robot

ABSTRACT

A local obstacle avoidance walking method of a self-moving robot, comprising: step  100 : the self-moving robot walks in a first direction, and when an obstacle is detected, the self-moving robot translates for a displacement M1 in a second direction perpendicular to the first direction, and step  200 : determining whether the self-moving robot is able to continue to walk in the first direction after the translation, if a result of the determination is positive, the self-moving robot continues to walk in the first direction, and if the result of the determination is negative, the self-moving robot acts according to a preset instruction. The method enables the robot to accurately avoid a local obstacle, provides a concise walking route, shortens the determination time, and improves the working efficiency of the self-moving robot.

FIELD OF THE INVENTION

The present invention relates to the technical field of the manufacture of small household electric appliances, and in particular relates to a local obstacle avoidance walking method of a self-moving robot.

BACKGROUND ART

The self-moving robot has been widely used for its convenient operation and free walking, and it can realize a variety of applications, including windows-wiping, floor-sweeping, air purification and so on. One walking method of the existing self-moving robot is the random walking method, under which walking method, when the robot meets an obstacle, it firstly moves back in its original moving direction so that there is enough space left between the robot and the obstacle, and then the body of the robot turns a certain small angle in the clockwise or anticlockwise direction and continues to walk. If the robot still meets an obstacle here, it will repeat the action of moving back and turning until it avoids the obstacle, and then the robot continues to walk. However, the walking tracks of the existing robot using this kind of local obstacle avoidance method are random and complex, which wastes plenty of work time and power, leading to a low efficiency of the obstacle avoidance. On the other hand, when the robot continues to walk after successfully avoiding the local obstacle, there will be a lot of missing regions left behind or around the obstacle which are unable for the robot to reach, so that the cleaning effect is poor.

SUMMARY OF THE INVENTION

To overcome the deficiencies in the prior art, the present invention aims to provide a local obstacle avoidance walking method of a self-moving robot, which greatly shortens the robot's walking path during the local obstacle avoidance process, improves the efficiency of the obstacle avoidance, and also reduces the area of the missing regions constituted by the blocking of a certain obstacle. Therefore, the working efficiency of the self-moving robot can be greatly improved.

The technical object of the present invention is achieved through the following technical solutions.

A local obstacle avoidance walking method of a self-moving robot is provided, and the method specifically comprises the following steps:

step 100: the self-moving robot walks in a first direction, and when an obstacle is detected, the self-moving robot translates for a displacement M1 in a second direction perpendicular to the first direction, and

step 200: determining whether the self-moving robot is able to continue to walk in the first direction after the translation, if a result of the determination is positive, the self-moving robot continues to walk in the first direction, and if the result of the determination is negative, the self-moving robot acts according to a preset instruction.

As needed, the action according to the preset instruction in the step 200 may comprise that the self-moving robot walks in the opposite direction to the first direction; or may further comprise that the self-moving robot translates for a displacement M1 in the second direction.

Specifically, the determination of whether the self-moving robot is able to continue to walk in the first direction in the step 200 specifically comprises that: the self-moving robot walks in the first direction firstly, and if an obstacle is not detected after that the self-moving robot walks for a certain distance, it is determined that the self-moving robot is able to continue to walk in the first direction; otherwise, it is determined that the self-moving robot is not able to continue to walk in the first direction.

In addition, there are a variety of methods which can be used to determine whether the self-moving robot is able to continue to walk in the first direction in the step 200, which specifically comprise that the bottom of the self-moving robot is provided with an attached suction cup which is used to detect whether there is a frameless edge;

or that the bottom of the self-moving robot is provided with a follower wheel which is used to detect whether there is a bump-like obstacle:

or that the side of the self-moving robot is provided with a side-looking sensor, and the self-moving robot determines whether it is able to continue to walk in the first direction according to a feedback signal of the side-looking sensor.

When the obstacle is a frameless edge, in order to prevent the self-moving robot from falling off, the step 100 specifically comprises that: the self-moving robot walks in the first direction, and when an obstacle is detected, the self-moving robot moves back for a certain distance in the first direction firstly, and then translates for a displacement M1 in the second 10 direction.

In conclusion, the present invention greatly shortens the robot's walking path during the local obstacle avoidance process, improves the efficiency of the obstacle avoidance, and also reduces the area of the missing regions constituted by the blocking of a certain obstacle. Therefore, the working efficiency of the self-moving robot can be greatly improved.

Hereinafter, the present invention is further described in detail with reference to the attached drawings and the embodiments.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic view of the obstacle avoidance walking of the window-wiping 20 robot of the present invention:

FIGS. 2 to 4 are schematic views of the local obstacle avoidance walking at L1, L2 and L3 in FIG. 1, respectively:

FIG. 5 is a structural schematic view of the window-wiping robot of the present invention; and

FIG. 6 and FIG. 7 are schematic views of the missing region caused due to the obstacle avoidance of the prior art and of the present invention, respectively.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

FIG. 1 is a schematic view of the obstacle avoidance walking of the window-wiping robot of the present invention. As shown in FIG. 1, the self-moving robot in the this embodiment is a window-wiping robot. The robot starts moving from the point “O” in the lower left corner shown in FIG. 1 and walks to the point “Z” in the upper right corner along a zigzag path (as indicated by the arrows in FIG. 1), in which the robot meets the local obstacles at L1, L2 and L3, respectively, thereby completing the traversal sweeping of the working region 100. The above mentioned obstacles include not only the bump-like obstacles in the traditional sense, but also the obstacles similar to the frameless edges, both of which are referred to as the obstacles.

FIGS. 2 to 4 are schematic views of the local obstacle avoidance walking at L1, L2 and L3 in FIG. 1, respectively, and FIG. 5 is a structural schematic view of the window-wiping robot of the present invention. In the following, the state of the local obstacle avoidance walking at each position will be described with reference to each of FIGS. 2-4 in combination with FIG. 5. Specifically, FIG. 2 is a schematic view of the obstacle 15 avoidance walking method at L1, which is at the frameless edge, in FIG. 1, and the attached suction cup 1000 provided on the window-wiping robot is used to detect the obstacles like the frameless edge. As shown in FIG. 2 and FIG. 5, the rectangular coordinate system is established with the second direction as the X axis and the first direction as the Y axis in order to make it easier to describe the walking direction of the window-wiping robot. Specifically, the process of the local obstacle avoidance walking method is as follows: firstly, the window-wiping robot walks in the positive direction of the Y axis, and when it is detected that an air leakage occurs on the attached suction cup 1000 provided on the window-wiping robot, this position is determined to be a frameless edge, under which case the window-wiping robot will walk for a certain distance in the negative direction of the Y axis, and then translate for a displacement M1 in the positive direction of the X axis; secondly, the window-wiping robot determines whether it is able to continue to walk in the positive direction of the Y axis after the above translation.

The specific process of determining whether the window-wiping robot is able to continue to walk in the positive direction of the Y axis is that: the window-wiping robot walks in the positive direction of the Y axis firstly, and if a frameless edge is not detected by the attached suction cup after that the window-wiping robot walks for a certain distance, it is determined that the window-wiping robot is able to walk in the positive direction of the Y axis; otherwise, it is determined that the window-wiping robot is not able to walk in the positive direction of the Y axis. It is a frameless edge here. Obviously, if the window-wiping robot continues to walk in the positive direction of the Y axis, the frameless edge will be detected again by the attached suction cup after that the window-wiping robot walks for a certain distance, that is, the determination result is no, and then the window-wiping robot will walk in the negative direction of the Y axis.

FIG. 3 is a schematic view of the obstacle avoidance walking method at L2, which is at the frame, in FIG. 1, and the follower wheel 2000 provided on the window-wiping robot is used to detect the bump-like obstacles. As shown in FIG. 3 and FIG. 5, the rectangular coordinate system is established with the second direction as the X axis and the first direction as the Y axis. Specifically, the process of the local obstacle avoidance walking method is as follows: firstly, the window-wiping robot walks in the negative direction of the Y axis, and when it is detected that the follower wheel 2000 provided on the window-wiping robot stops turning, this position is determined to be a bump-like obstacle, under which case the window-wiping robot will translate for a displacement M1 in the positive direction of the X axis: secondly, the window-wiping robot determines whether it is able to continue to walk in the negative direction of the Y axis after the above translation. It is to be noted that it is only one example method that the structure of the follower wheel is used to detect whether the window-wiping robot hits the bump-like obstacle, but the detection method is not limited to this. For example, it can also achieve the same detection effect by providing a collision plate on the periphery of the window-wiping robot.

As shown in FIG. 3, the specific process of determining whether the window-wiping robot is able to continue to walk in the negative direction of the Y axis is that: the window-wiping robot tries to walk in the negative direction of the Y axis firstly, and if a bump-like obstacle is not detected by the follower wheel after that the window-wiping robot walks for a certain distance, it is determined that the window-wiping robot is able to walk in the negative direction of the Y axis: otherwise, it is determined that the window-wiping robot is not able to walk in the negative direction of the Y axis. It is a frame here. Obviously, the self-moving robot can't continue to walk in the negative direction of the Y axis due to being blocked by the frame, and the bump-like obstacle is detected again by the follower wheel 2000, that is, the determination result is no, and then the window-wiping robot will walk in the positive direction of the Y axis.

FIG. 4 is a schematic view of the obstacle avoidance walking method at L3, which is at the obstacle within the walking region, in FIG. 1, and the obstacle is also a bump-like obstacle. As shown in FIG. 4 and FIG. 5, the rectangular coordinate system is established with the second direction as the X axis and the first direction as the Y axis. Specifically, the process of the local obstacle avoidance walking method is as follows: firstly, the window-wiping robot walks in the positive direction of the Y axis, and when an obstacle is detected, the window-wiping robot translates for a displacement M1 in the positive direction of the X axis, secondly, the window-wiping robot determines whether it is able to continue to walk in the positive direction of the Y axis after the above translation.

The specific process of determining whether the window-wiping robot is able to continue to walk in the positive direction of the Y axis is basically the same as that of the above determination method of walking to the frame, and thus it is omitted here. The difference therebetween is that the window-wiping robot in this embodiment firstly tries to continue to walk in the positive direction of the Y axis after the translating for a displacement M1 in the positive direction of the X axis, and if the obstacle is not detected after that the window-wiping robot walks for a certain distance, the window-wiping robot continues to walk in the positive direction of the Y axis until reaching the frameless edge. At this point, the window-wiping robot also firstly tries to continue to walk in the original direction, i.e. in the positive direction of the Y axis, after the translating for a displacement M1 in the positive direction of the X axis, and if it is determined that it is still the frameless edge and it is not able to continue to walk in the original direction, the window-wiping robot will walk in the negative direction of the Y axis. The determination of the above L2 position is carried out when meeting the frame, and then the robot repeats the movement until reaching the point “Z”, thereby completing the sweeping of the working region 100. Obviously, there is a missing region above the obstacle M, i.e. the F zone in FIG. 7, in the case of the above walking method. As shown in FIG. 1, in order to optimize the walking path and avoid a missing region, when the robot gets away from the obstacle M at L3 and detects the frameless edge, the robot is controlled to walk in the negative direction of the X axis, thereby completing the traversal walking on the region above the obstacle M.

In the above embodiments, the window-wiping robot firstly tries to walk for a certain distance in the original walking direction along the Y axis after translating along X axis, and then determines whether it is able to walk in the original walking direction along the Y axis through the detection information of the attached suction cup and the follower wheel. Of course, the method that determines whether the window-wiping robot is able to walk in to the original walking direction along the Y axis is not limited to this. For example, the side of the window-wiping robot can be provided with a side-looking sensor, and the window-wiping robot can also determine whether it is able to walk in the positive direction of the Y axis according to a feedback signal of the side-looking sensor. Specifically, it can be achieved by providing an infrared transmitter and an infrared receiver on the side of the robot in the horizontal direction, in which the signal transmitted by the transmitter is reflected by the frame and then received by the receiver in the case of the frame; and the signal is transmitted obliquely downward by the transmitter and then received by the receiver correspondingly in the case of the frameless edge.

It is to be noted that the local obstacle avoidance walking method of a self-moving robot is described by taking the window-wiping robot as an example only in the above embodiment. Of course, in addition to the window-wiping robot, the above method is also applicable to the other self-moving robots including the floor-sweeping robot.

In view of the above contents, the present invention provides a local obstacle avoidance walking method of a self-moving robot, and the method specifically comprises the following steps:

step 100: the self-moving robot walks in a first direction, and when an obstacle is detected, the self-moving robot translates for a displacement M1 in a second direction perpendicular to the first direction; and

step 200: determining whether the self-moving robot is able to continue to walk in the first direction after the translation, if a result of the determination is positive, the self-moving robot continues to walk in the first direction, and if the result of the determination is negative, the self-moving robot acts according to a corresponding instruction.

As needed, the action according to the corresponding instruction in the step 200 may comprise that the self-moving robot walks in the opposite direction to the first direction; or may further comprise that the self-moving robot translates for a displacement M1 in the second direction.

Specifically, the determination of whether the self-moving robot is able to continue to walk in the first direction in the step 200 specifically comprises that: the self-moving robot to walks in the first direction firstly, and if an obstacle is not detected after that the self-moving robot walks for a certain distance, it is determined that the self-moving robot is able to continue to walk in the first direction; otherwise, it is determined that the self-moving robot is not able to continue to walk in the first direction.

In addition, there are a variety of methods which can be used to determine whether the self-moving robot is able to continue to walk in the first direction in the step 200, which specifically comprise that the bottom of the self-moving robot is provided with an attached suction cup which is used to detect whether there is a frameless edge;

or that the bottom of the self-moving robot is provided with a follower wheel which is used to detect whether there is a bump-like obstacle:

or that the side of the self-moving robot is provided with a side-looking sensor, and the self-moving robot determines whether it is able to continue to walk in the first direction according to a feedback signal of the side-looking sensor.

When the obstacle is a frameless edge, in order to prevent the self-moving robot from falling off, the step 100 specifically comprises that: the self-moving robot walks in the first direction, and when an obstacle is detected, the self-moving robot moves back for a certain distance in the first direction firstly, and then translates for a displacement M1 in the second direction.

FIG. 6 and FIG. 7 are schematic views of the missing region caused due to the obstacle avoidance of the prior art and of the present invention, respectively. As shown in FIG. 6, when the robot in the prior art walks in the direction of A and meets the obstacle N, it walks in the direction of B1 or B2 and avoids the obstacle N finally by repeatedly moving back and turning. In this case, the missing region caused by the obstacle N is the sectorial area of the C zone. As shown in FIG. 7, when the robot in the present invention walks in the direction of A and meets the obstacle N, it can avoid the obstacle N finally by the motion track in the direction D translating to the left or by the motion track in the direction E translating to the right. In this case, the missing region caused by the obstacle N is the rectangular area of the F zone. Obviously, the area of the C zone is much larger than that of the F zone.

In conclusion, the present invention greatly shortens the robot's walking path during the local obstacle avoidance process, improves the efficiency of the obstacle avoidance, and also reduces the area of the missing regions constituted by the blocking of a certain obstacle.

Therefore, the working efficiency of the self-moving robot can be greatly improved. 

1. An obstacle avoidance walking method of a self-moving robot, in a walking area of the self moving robot, a rectangular plane coordinate system is established with the horizontal direction as the X axis and the vertical direction as the Y axis, characterized in that, the method specifically comprises the following steps: step 100: the self-moving robot walks along the Y axis, when the self-moving robot walks forwardly along the Y axis and detects obstacle, it sets an obstacle point at the current position as an upside obstacle point and stores valid upside obstacle points as upside recorded points; when the self-moving robot walks reversely along the Y axis and detects obstacle, it sets an obstacle point at the current position as a downside obstacle point and stores valid downside obstacle points as downside recorded points; step 200: according to storage sequence, the upside recorded points are classified into a current upside recorded point and previous upside recorded points, and the downside recorded points are classified into a current downside recorded point and previous downside recorded points; step 300: if the current obstacle point is the upside obstacle point, it is determined whether there is before the current upside obstacle point a previous upside recorded point the Y-axis coordinate of which is less than that of the current upside obstacle point; and if the current obstacle point is the downside obstacle point, it is determined whether there is before the current downside obstacle point a previous downside recorded point, the Y-axis coordinate of which is larger than that of the current downside obstacle point; step 400: if the determination result is positive, the previous upside recorded point or the previous downside recorded point is a turning point, the self-moving robot walks along the X axis from the current obstacle point toward the turning point to the X-axis coordinate of the turning point, deletes the coordinate of the turning point, and returns to the step 100 after completing traversal walking in an area between the turning point and the current obstacle point; and if the determination result is negative, the self-moving robot moves for a displacement M1 along the X axis; step 500: the self-moving robot walks along a direction opposite to the former Y-axis walking direction, and returns to the step 100; step 600: the step 100 to the step 500 are repeated until traversal walking in the walking area is completed.
 2. The obstacle avoidance walking method of the self-moving robot of claim 1, characterized in that, the step 100 specifically further comprises: if the Y-axis coordinate of the current upside obstacle point is different from that of each of the previous upside recorded points, the current upside obstacle point is the valid upside obstacle point; and if the Y-axis coordinate of the current downside obstacle point is different from that of each of the previous downside recorded points, the current downside obstacle point is the valid downside obstacle point.
 3. The obstacle avoidance walking method of the self-moving robot of claim 1, characterized in that, the step 100 specifically further comprises: each of the upside obstacle points is the valid upside obstacle point; and each of the downside obstacle points is the valid downside obstacle point.
 4. The obstacle avoidance walking method of the self-moving robot of claim 3, characterized in that, the step 400 specifically further comprises: if the determination result is positive, difference values of the X-axis coordinates of all of the upside recorded points or the downside recorded points that satisfy the determination condition from the X-axis coordinate of the current obstacle point are compared, and the upside recorded point or the downside recorded point having the largest difference value is taken as the turning point.
 5. The obstacle avoidance walking method of the self-moving robot of claim 4, characterized in that, the step 400 specifically further comprises: if the determination result is positive, the coordinates of all of the upside recorded points or the downside recorded points that satisfy the determination condition are deleted.
 6. The obstacle avoidance walking method of the self-moving robot of claim 1, characterized in that, the step 400 specifically further comprises: if the self-moving robot detects obstacle again before reaching the X axis coordinate of the turning point, the coordinate of the turning point is deleted and the method proceeds to the step
 500. 7. The obstacle avoidance walking method of the self-moving robot of claim 1, characterized in that, in the step 400, the self-moving robot performs traversal walking in the area between the turning point and the current obstacle point in the same walking mode as it completes traversal walking in the walking area in the step
 600. 8. The obstacle avoidance walking method of the self-moving robot of claim 1, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 9. The obstacle avoidance walking method of the self-moving robot of claim 8, characterized in that, the determining of whether the self-moving robot can walk along the former Y-axis walking direction in the step 400 specifically comprises: the self-moving robot firstly walks along the former Y-axis walking direction, if the self-moving robot does not detect obstacle after walking for a certain distance, it is determined that the self-moving robot can walk along the former Y-axis walking direction; otherwise, it is determined that the self-moving robot cannot walk along the former Y-axis walking direction.
 10. The obstacle avoidance walking method of the self-moving robot of claim 8, characterized in that, a side-looking sensor is provided on a side the self-moving robot, and the determining of whether the self-moving robot can walk along the former Y-axis walking direction in the step 400 specifically comprising: according to a feedback signal of the side-looking sensor, the self-moving robot determines whether it can walk along the former Y-axis walking direction.
 11. An obstacle avoidance walking method of a self-moving robot, in a walking area of the self-moving robot, a rectangular plane coordinate system is established with the horizontal direction as the X axis and the vertical direction as the Y axis, and walking along the direction of the X axis or the Y axis is a forward walking; characterized in that, the method specifically comprises the following steps: step 1000: the self-moving robot walks along the Y axis, when the self-moving robot detects obstacle, the current position is set as an obstacle point and the coordinate of the current position is stored as a recorded point; step 2000: it is determined whether a recorded point, the Y-axis coordinate of which is within a numerical interval defined by the Y-axis coordinates of the current obstacle point and the previous obstacle point, has been stored previously; step 3000: if the determination result is positive, the recorded point is a turning point, and the self-moving robot walks along the X axis from the current obstacle point toward the turning point to the X-axis coordinate of the turning point, deletes the coordinate of the turning point, and the method returns to the step 1000 after performing traversal walking in an area between the turning point and the current obstacle point; and if the determination result is negative, the self-moving robot shifts for a displacement M1 along the X axis; step 4000: the self-moving robot walks along a reverse direction opposite to the former Y-axis walking direction, and the method returns to the step 1000; step 5000: the step 1000 to the step 4000 are repeated until Y-axis traversal walking in the walking area is completed.
 12. The obstacle avoidance walking method of the self-moving robot of claim 2, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 13. The obstacle avoidance walking method of the self-moving robot of claim 3, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 14. The obstacle avoidance walking method of the self-moving robot of claim 4, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 15. The obstacle avoidance walking method of the self-moving robot of claim 5, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 16. The obstacle avoidance walking method of the self-moving robot of claim 6, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 17. The obstacle avoidance walking method of the self-moving robot of claim 7, characterized in that, after the step 400, further comprising: step 410: it is determined whether the self-moving robot can walk along the former Y-axis walking direction, if the determination result is positive, the self-moving robot walks along the former Y-axis walking direction and returns to the step 100; and if the determination result is negative, the method proceeds to the step
 500. 